K-d tree

Results: 206



#Item
41CCCG 2013, Waterloo, Ontario, August 8–10, 2013  Data Structures for Incremental Extreme Ray Enumeration Algorithms Blagoy Genov∗  Abstract

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Data Structures for Incremental Extreme Ray Enumeration Algorithms Blagoy Genov∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:58
42Computing Nearest-Neighbor Fields via Propagation-Assisted KD-Trees Kaiming He Jian Sun Microsoft Research Asia  Abstract

Computing Nearest-Neighbor Fields via Propagation-Assisted KD-Trees Kaiming He Jian Sun Microsoft Research Asia Abstract

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2012-03-19 08:26:17
43EUROGRAPHICST. Akenine-Möller and M. Zwicker (Guest Editors) Volume), Number 2  Fitted BVH for Fast Raytracing of Metaballs

EUROGRAPHICST. Akenine-Möller and M. Zwicker (Guest Editors) Volume), Number 2 Fitted BVH for Fast Raytracing of Metaballs

Add to Reading List

Source URL: www.irit.fr

Language: English - Date: 2010-02-03 10:48:47
4428  CHAPTER 14. APPROXIMATE TREE PATTERN MATCHING Zhang, K., R. Statman and D. Shasha [1992]. \On the editing distance between unordered

28 CHAPTER 14. APPROXIMATE TREE PATTERN MATCHING Zhang, K., R. Statman and D. Shasha [1992]. \On the editing distance between unordered

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2006-04-04 16:44:52
45CCCG 2011, Toronto ON, August 10–12, 2011  On Finding Skyline Points for Range Queries in Plane Anil Kishore Kalavagattu  ∗

CCCG 2011, Toronto ON, August 10–12, 2011 On Finding Skyline Points for Range Queries in Plane Anil Kishore Kalavagattu ∗

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:15
46CCCG 2011, Toronto ON, August 10–12, 2011  A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗  John Hershberger†

CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
47Space-Efficient Algorithms for Klee’s Measure Problem Eric Y. Chen∗ Timothy M. Chan†  rithm needs one priority queue and one segment tree

Space-Efficient Algorithms for Klee’s Measure Problem Eric Y. Chen∗ Timothy M. Chan† rithm needs one priority queue and one segment tree

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
48CCCG 2006, Kingston, Ontario, August 14–16, Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram Stefan Funke†∗  Theocharis Malamatos†

CCCG 2006, Kingston, Ontario, August 14–16, Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram Stefan Funke†∗ Theocharis Malamatos†

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2006-06-29 12:03:57
49CCCG 2011, Toronto ON, August 10–12, 2011  A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗  John Hershberger†

CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
50CCCG 2013, Waterloo, Ontario, August 8–10, 2013  The Unified Segment Tree and its Application to the Rectangle Intersection Problem David P. Wagner∗

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 The Unified Segment Tree and its Application to the Rectangle Intersection Problem David P. Wagner∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:58